Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
نویسندگان
چکیده
منابع مشابه
Robust Optimization of Unconstrained Binary Quadratic Problems
In this paper we focus on the unconstrained binary quadratic optimization model, maximize xQx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, pa...
متن کاملPreprocessing of Unconstrained Quadratic Binary Optimization
We propose several efficient preprocessing techniques for Unconstrained Quadratic Binary Optimization (QUBO), including the direct use of enhanced versions of known basic techniques (e.g., implications derived from first and second order derivatives and from roof–duality), and the integrated use (e.g., by probing and by consensus) of the basic techniques. The application of these techniques is ...
متن کاملNeighborhood Combination for Unconstrained Binary Quadratic Problems
We present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms, using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study. The goal of the analysis is to help understand why, when and how some neighborhoods can be favorably combined to increase their search power. Our study investigates combined neighborhoods with two t...
متن کاملUnconstrained formulation of standard quadratic optimization problems
A standard quadratic optimization problem (StQP) consists of finding the largest or smallest value of a (possibly indefinite) quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard problem has several immediate real-world applications like the Maximum-Clique Problem, and it also occurs in a natural way as a subproblem in quadra...
متن کاملDiversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2TS) algorithm for solving unconstrained binary quadratic problems. D2TS is distinguished by the introduction of a perturbation-based diversification strategy guided by longterm memory. The performance of the proposed algorithm is assessed on the largest instances from theORLIB library (up to 2500 variables) as well as still larger ins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.07.009